Primitive Prime Factors in Second-order Linear Recurrence Sequences
نویسندگان
چکیده
For a class of Lucas sequences {xn}, we show that if n is a positive integer then xn has a primitive prime factor which divides xn to an odd power, except perhaps when n = 1, 2, 3 or 6. This has several desirable consequences.
منابع مشابه
Primitive Prime Divisors of First-Order Polynomial Recurrence Sequences
The question of which terms of a recurrence sequence fail to have primitive prime divisors has been significantly studied for several classes of linear recurrence sequences and for elliptic divisibility sequences. In this paper, we consider the question for sequences generated by the iteration of a polynomial. For two classes of polynomials f(x) ∈ Z[x] and initial values a1 ∈ Z, we show that th...
متن کاملPrimitive Prime Divisors in Polynomial Arithmetic Dynamics
The question of which terms of a recurrence sequence fail to have primitive prime divisors has been significantly studied for several classes of linear recurrence sequences and for elliptic divisibility sequences. In this paper, we consider the question for sequences generated by the iteration of a polynomial. For two classes of polynomials f(x) ∈ Z[x] and initial values a1 ∈ Z, we show that th...
متن کاملToeplitz transforms of Fibonacci sequences
We introduce a matricial Toeplitz transform and prove that the Toeplitz transform of a second order recurrence sequence is another second order recurrence sequence. We investigate the injectivity of this transform and show how this distinguishes the Fibonacci sequence among other recurrence sequences. We then obtain new Fibonacci identities as an application of our transform.
متن کاملEquidistribution of Linear Recurring Sequences in Finite Fields
According to a general principle established by the first author [ 121, any linear recurring sequence in a finite field which hes a sufficiently long period is almost equidistributed, in the sense that each element of the field occurs about equally often in the full period of the sequence. This raises the question of characterizing those linear recurring sequences for which we have exact equidi...
متن کاملPseudoprimes for Higher-order Linear Recurrence Sequences
With the advent of high-speed computing, there is a rekindled interest in the problem of determining when a given whole number N > 1 is prime or composite. While complex algorithms have been developed to settle this for 200-digit numbers in a matter of minutes with a supercomputer, there is a need for simpler, more practical algorithms for dealing with numbers of a more modest size. Such practi...
متن کامل